Combinatorial constructions associated to the dynamics of one-sided cellular automata
نویسندگان
چکیده
In this paper we study combinatorial constructions which lead to one-sided invertible cellular automata with di5erent dynamical behavior: equicontinuity, existence of equicontinuous points but not equicontinuity, sensitivity and expansivity. In particular, we provide a simple characterization of the class of equicontinuous invertible one-sided cellular automata and we construct families of expansive one-sided cellular automata. c © 2003 Elsevier B.V. All rights reserved. MSC: primary 58F08; secondary 58F03; 54H20
منابع مشابه
A Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem
Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the J...
متن کاملNovel Phase-frequency Detector based on Quantum-dot Cellular Automata Nanotechnology
The electronic industry has grown vastly in recent years, and researchers are trying to minimize circuits delay, occupied area and power consumption as much as possible. In this regard, many technologies have been introduced. Quantum Cellular Automata (QCA) is one of the schemes to design nano-scale digital electronic circuits. This technology has high speed and low power consumption, and occup...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملComparism of Radius 1=2 and Radius 1 Paradigms in One Dimensional Reversible Cellular Automata Institutsbericht 536
We compare the usefulness of the paradigms of radius 1 and radius 1=2 reversible cellular automata. Although the two techniques are equivalent, it is seen that the radius 1=2 paradigm leads to clearer theory, a combinatorial model with good explicit constructions and possibly to a better intuition. The results include related construction methods for both paradigms, in the radius 1=2 case an ex...
متن کاملBI-OBJECTIVE OPTIMIZATION OF RESERVOIR OPERATION BY MULTI-STEP PARALLEL CELLULAR AUTOMATA
Parallel Cellular Automata (PCA) previously has been employed for optimizing bi-objective reservoir operation, where one release is used to meet both objectives. However, if a single release can only be used for one objective, meaning two separate sets of releases are needed, the method is not applicable anymore. In this paper, Multi-Step Parallel Cellular Automata (MSPCA) has been developed fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 1-3 شماره
صفحات -
تاریخ انتشار 2003